package com.slavic.vesna.leet.leet;

public class Leet5478 {

    public int maxSum(int[] nums1, int[] nums2) {



        return 0;
    }

    public int maxSum1(int[] nums1,int c1, int[] nums2, int c2) {

        if (c1 == nums1.length - 1) {

        }


        return 0;
    }

}
